Distinct volume subsets via indiscernibles
نویسندگان
چکیده
منابع مشابه
Distinct volume subsets
Suppose that a and d are positive integers with a ≥ 2. Let ha,d(n) be the largest integer t such that any set of n points in Rd contains a subset of t points for which all the nonzero volumes of the (t a ) subsets of order a are distinct. Beginning with Erdős in 1957, the function h2,d(n) has been closely studied and is known to be at least a power of n. We improve the best known bound for h2,d...
متن کاملDisassociated indiscernibles
This work defines a variant of Prikry forcing and applies it to increase the number of normal measures on a single cardinal, relying on a large cardinal property of consistency strength between measurable and Mitchell order two. In particular, from an assumption weaker than o(κ) = 2, there is a forcing extension in which the first measurable cardinal κ has any number λ ≤ κ of normal measures.
متن کاملIndiscernibles and dimensional compactness
Abstract. This is a contribution to the theory of topological vector spaces within the framework of the alternative set theory. Using indiscernibles we will show that every infinite set uS ⊆ G in a biequivalence vector space 〈W,M,G〉, such that x − y / ∈ M for distinct x, y ∈ u, contains an infinite independent subset. Consequently, a class X ⊆ G is dimensionally compact iff the π-equivalence . ...
متن کاملTumor-associated macrophages in breast cancer: distinct subsets, distinct functions.
Macrophages display remarkable plasticity, allowing these cells to adapt to changing microenvironments and perform functions as diverse as tissue development and homeostasis, inflammation, pathogen clearance and wound healing. Macrophage activation can be triggered by Th1 cytokines and pathogen-associated or endogenous danger signals, leading to the formation of classically activated or M1 macr...
متن کاملModels Without Indiscernibles
For T any completion of Peano Arithmetic and for n any positive integer, there is a model of T of size 2, with no (n + 1)-length sequence of indiscernibles. Hence the Hanf number for omitting types over T, H(T), is at least 2, (Now, using an upper bound previously obtained by Julia Knight H (true arithmetic) is exactly 2b,.) If TX true arithmetic, then H(T) = 2,. If 8 -A (p)'-, then any complet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2018
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-018-0646-z